Coding Theorems on the Threshold Scheme for a General Source
نویسندگان
چکیده
منابع مشابه
Almost-Sure Variable-Length Source Coding Theorems for General Sources
Source coding theorems for general sources are presented. For a source , which is assumed to be a probability measure on all strings of infinite-length sequence with a finite alphabet, the notion of almost-sure sup entropy rate is defined; it is an extension of the Shannon entropy rate. When both an encoder and a decoder know that a sequence is generated by , the following two theorems can be p...
متن کاملCoding Theorems for a (2, 2)-Threshold Scheme With Detectability of Impersonation Attacks
In this paper, we discuss coding theorems on a (2, 2)–threshold scheme in the presence of an opponent who impersonates one of the two participants in an asymptotic setup. We consider a situation where n secrets Sn from a memoryless source is blockwisely encoded to two shares and the two shares are decoded to Sn with permitting negligible decoding error. We introduce correlation level of the two...
متن کاملA Suitable Coding Scheme for Broadband Power-line Communication
This paper introduces three coding strategies for using the Luby Transform (LT) code in a relay aided power-line communication scheme. In the first method, the relay decodes the received packets and re-encodes them for transmission towards the destination. In the second method, the relay only forwardes a random linear combination of its received packets towards the destination, while in the thi...
متن کاملA method for proving multiterminal source coding theorems
The optimal coding problem in two-user white Gaussianchannels with feedback is discussed. The messages are taken as Gauss-Markov processes. The optimal decoder pair and the optimal linear encoderpair are developed. A nonlinear class (additive feedback type) of encoderpairs in which the optimal linear encoder pair is optimal is presented.
متن کاملA new universal coding scheme for the binary memoryless source
A coding scheme for the binary memoryless source is presented. The scheme is an extension of a scheme discovered by Lynch and Davisson and developed by Schalkwijk, and is based upon the Schalkwijk algorithm for the Lynch-Davisson (LD) code. The new coding scheme is shown to be asymptotically optimal as the block length approaches infinity, regardless of the source statistics. Although the LD sc...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: IEEE Transactions on Information Theory
سال: 2008
ISSN: 0018-9448
DOI: 10.1109/tit.2008.921860